Correctness Proof of the SBT method
نویسندگان
چکیده
In this paper, we prove the correctness of the SBT method, which we proposed in a previous paper [1]. SBT is a string matching method optimized for high-speed multi-stream packet scanning on FPGA. The SBT method is capable of lightweight switching between TCP streams, and enables easy implementation of multi-stream scanners. In addition, we achieved over 10Gbps string matching bandwidth using a Xilinx XC2V6000 FPGA. In this paper, we present a correctness proof of the SBT method, which we could not presented in the previous paper [1] due to the space limitation. ANY OTHER IDENTIFYING INFORMATION OF THIS REPORT DISTRIBUTION STATEMENT This technical report is available ONLY via anonymous FTP from ftp.is.s.u-tokyo.ac.jp (directory /pub/tech-reports). SUPPLEMENTARY NOTES REPORT DATE October 20, 2004 TOTAL NO. OF PAGES 11 WRITTEN LANGUAGE English NO. OF REFERENCES 12 DEPARTMENT OF INFORMATION SCIENCE Faculty of Science, University of Tokyo 7-3-1 Hongo, Bunkyo-ku, Tokyo 113, Japan Correctness Proof of the SBT method Yutaka Sugawara, Mary Inaba, and Kei Hiraki
منابع مشابه
On the relation between size-based termination and semantic labelling
We investigate the relationship between two independently developed termination techniques. On the one hand, sized-types based termination (SBT) uses types annotated with size expressions and Girard's reducibility candidates, and applies on systems using constructor matching only. On the other hand, semantic labelling transforms a rewrite system by annotating each function symbol with the seman...
متن کاملOn the Relation between Sized-Types Based Termination and Semantic Labelling
We investigate the relationship between two independently developed termination techniques. On the one hand, sized-types based termination (SBT) uses types annotated with size expressions and Girard’s reducibility candidates, and applies on systems using constructor matching only. On the other hand, semantic labelling transforms a rewrite system by annotating each function symbol with the seman...
متن کاملAn Inductive Proof Method for Simulation-based Compiler Correctness
We study induction on the program structure as a proof method for bisimulation-based compiler correctness. We consider a first-order language with mutually recursive function definitions, system calls, and an environment semantics. The proof method relies on a generalization of compatibility of function definition with the bisimulation. We use the inductive method to show correctness of a form ...
متن کاملCorrectness of logic programs using proof schemes
The correctness of logic programs which are constructed by a schema-based method is presented in this paper. This schema-based method constructs typed, moded logic programs by stepwise top-down design using five program schemata, data types and modes. Correctness proofs in this approach are guided by the constructed logic programs. A proof scheme is proposed for each program schema. It is claim...
متن کاملA Trust Based Probabilistic Method for Efficient Correctness Verification in Database Outsourcing
Correctness verification of query results is a significant challenge in database outsourcing. Most of the proposed approaches impose high overhead, which makes them impractical in real scenarios. Probabilistic approaches are proposed in order to reduce the computation overhead pertaining to the verification process. In this paper, we use the notion of trust as the basis of our probabilistic app...
متن کامل